Lifting QBF Resolution Calculi to DQBF
نویسندگان
چکیده
We examine existing resolution systems for quantified Boolean formulas (QBF) and answer the question which of these calculi can be lifted to the more powerful Dependency QBFs (DQBF). An interesting picture emerges: While for QBF we have the strict chain of proof systems Q-Res < IR-calc < IRM-calc, the situation is quite different in DQBF. The obvious adaptations of Q-Res and likewise universal resolution are too weak: they are not complete. The obvious adaptation of IR-calc has the right strength: it is sound and complete. IRM-calc is too strong: it is not sound any more, and the same applies to long-distance resolution. Conceptually, we use the relation of DQBF to effectively propositional logic (EPR) and explain our new DQBF calculus based on IR-calc as a subsystem of first-order resolution.
منابع مشابه
Third International Workshop on Quantified Boolean Formulas (QBF 2015)
3 Contributions 3 3.1 Friedrich Slivovsky : Dependency Schemes for Quantified Boolean Formulas (Invited Talk) . . . . . . . . . . . . . . . . . . . . . 3 3.2 Olaf Beyersdorff, Leroy Chew, Meena Mahajan and Shukla Anil : Feasible Interpolation for QBF Resolution Calculi . . . 4 3.3 Valeriy Balabanov, Jie-Hong Roland Jiang and Christoph Scholl : Skolem functions computation for CEGAR based QBF so...
متن کاملA DPLL Algorithm for Solving DQBF
Dependency Quantified Boolean Formulas (DQBF) comprise the set of propositional formulas which can be formulated by adding Henkin quantifiers to Boolean logic. We are not aware of any published attempt in solving this class of formulas in practice. However with DQBF being NEXPTIME-complete, efficient ways of solving it would have many practical applications. In this paper we describe a DPLL-sty...
متن کاملPreprocessing for DQBF
For SAT and QBF formulas many techniques are applied in order to reduce/modify the number of variables and clauses of the formula, before the formula is passed to the actual solving algorithm. It is well known that these preprocessing techniques often reduce the computation time of the solver by orders of magnitude. In this paper we generalize different preprocessing techniques for SAT and QBF ...
متن کاملEncodings of Bounded Synthesis
The reactive synthesis problem is to compute a system satisfying a given specification in temporal logic. Bounded synthesis is the approach to bound the maximum size of the system that we accept as a solution to the reactive synthesis problem. As a result, bounded synthesis is decidable whenever the corresponding verification problem is decidable, and can be applied in settings where classic sy...
متن کاملDependency Schemes in QBF Calculi: Semantics and Soundness
We study the parametrization of QBF resolution calculi by dependency schemes. One of the main problems in this area is to understand for which dependency schemes the resulting calculi are sound. Towards this end we propose a semantic framework for variable independence based on ‘exhibition’ by QBF models, and use it to define a property of dependency schemes called full exhibition. We prove tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 23 شماره
صفحات -
تاریخ انتشار 2016